Evolution-Based Scheduling of Fault-Tolerant Programs on Multiple Processors

نویسندگان

  • Piotr Jedrzejowicz
  • Ireneusz Czarnowski
  • Henryk Szreder
  • Aleksander Skakovski
چکیده

The paper introduces a family of scheduling problems called fault-tolerant programs scheduling (FTPS). Since FTPS problems are, in general, computationally di cult, a challenge is to nd e ective scheduling procedures. Three evolution-based algorithms solving three basic kinds of FTPS problems have been proposed. The problems involve scheduling multiple variant tasks on multiple identical processors under time constraints. To validate the algorithms computational experiment has been carried. Experiment results show that evolution based algorithms produce satisfactory to good solutions in reasonable time.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliability-Driven Fault Tolerant Scheduling Heuristics for Distributed Embedded Real-Time Systems

We present a new scheduling approach to produce automatically a fault tolerant distributed schedule for critical distributed and real-time embedded systems. The approach that we propose take as input a set of operations (tasks), a target distributed architecture, some distribution constraints, some indications on the execution times of the operations on the processors of the target architecture...

متن کامل

Virtual channels for fault-tolerant programmable two-dimensional processor arrays

A programmable two-dimensional (2D) processor array is fault-tolerant if faulty processors can be detected, and then avoided during program execution. In the literature there are many schemes on detecting faulty processors and reconfiguring data routing to avoid them. However, an efficient implementation of these schemes on a 2D array can be an extremely difficult programming task if applicatio...

متن کامل

A Fault–Tolerant Dynamic Scheduling Algorithm for Multiprocessor Real–Time Systems

Scheduling multiple versions of the tasks on different processors can provide fault tolerant. One of the models that is used for fault-tolerant scheduling of real–time tasks, namely, is the Primary backup (PB) model. In this approach, two versions are executed serially on two different processors and an acceptance test is used to check the result. The backup version is executed only if the outp...

متن کامل

Stability Assessment Metamorphic Approach (SAMA) for Effective Scheduling based on Fault Tolerance in Computational Grid

Grid Computing allows coordinated and controlled resource sharing and problem solving in multi-institutional, dynamic virtual organizations. Moreover, fault tolerance and task scheduling is an important issue for large scale computational grid because of its unreliable nature of grid resources. Commonly exploited techniques to realize fault tolerance is periodic Checkpointing that periodically ...

متن کامل

Performance Evaluation of Integrated Fault-Tolerant Technique: Simulation Study

In earlier work we have proposed the concept of the dynamic group maximum matching for grouping the system graph into groups of different sizes according to the tasks arriving at the system. Also, we have developed a more efficient integrated fault-tolerant technique for ultra-reliable execution of tasks where both hardware (processors and communication channels) and software failures, and on-l...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999